ACCELERATING SELECT WHERE AND SELECT JOIN QUERIES ON A GPU
نویسندگان
چکیده
منابع مشابه
Accelerating Select where and Select Join Queries on a GPU
This paper presents implementations of a few selected SQL operations using the CUDA programming framework on the GPU platform. Nowadays, the GPU’s parallel architectures give a high speed-up on certain problems. Therefore, the number of non-graphical problems that can be run and sped-up on the GPU still increases. Especially, there has been a lot of research in data mining on GPUs. In many case...
متن کاملselect * where { : I : trust : you }
Finding, accessing and consuming multimedia content on the Web is still a challenge. In this position statement we discuss three still widely neglected issues arising when one is interacting with multimedia content in social media environments: provenance, trust, and privacy. We will introduce a generic model allowing us to identify potential risks and problems, further discuss this model regar...
متن کاملPractical Implementation of Rank and Select Queries
Research on succinct data structures has made significant progress in recent years. An essential building block of many of those techniques is a data structure to perform rank and select operations over a bit array. The first operation tells how many bits are set up to some position, and the second the position of the i-th bit set. Albeit there exist constanttime solutions that require sublinea...
متن کاملBroadword Implementation of Rank/Select Queries
Research on succinct data structures (data structures occupying space close to the informationtheoretical lower bound, but achieving speed similar to their standard counterparts) has steadily increased in the last few years. However, many theoretical constructions providing asymptotically optimal bounds are unusable in practise because of the very large constants involved. The study of practica...
متن کاملSelect-Project Queries over XML Documents
This paper discusses evaluation of select-project (SP) queries over an XML document. A SP query consists of two parts: (1) a conjunction of conditions on values of labels (called the selection) and (2) a series of labels whose values should be outputed (called the projection). Query evaluation involves finding tuples of nodes that have the labels mentioned in the query and are related to one an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science
سال: 2013
ISSN: 1508-2806
DOI: 10.7494/csci.2012.14.2.243